Entropy Minimizing Curves with Application to Flight Path Design and Clustering
نویسندگان
چکیده
منابع مشابه
Entropy Minimizing Curves with Application to Automated Flight Path Design
Air traffic management (ATM) aims at providing companies with a safe and ideally optimal aircraft trajectory planning. Air traffic controllers act on flight paths in such a way that no pair of aircraft come closer than the regulatory separation norm. With the increase of traffic, it is expected that the system will reach its limits in a near future: a paradigm change in ATM is planned with the ...
متن کاملEntropy Minimizing Curves with Application to Flight Path Design and Clustering
Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l’Aérien (MAIAA), Département Sciences et Ingénierie de la Navigation Aérienne (SINA), École Nationale de l’Aviation Civile (ENAC), 7 avenue Edouard Belin CS 54005, 31055 Toulouse, France; [email protected] * Correspondence: [email protected]; Tel.: +33-5-6217-9503 † This paper is an extended version of our...
متن کاملClustering Techniques for Minimizing External Path Length
There are a variety of main-memory access structures, such as segment trees, and quad trees, whose properties, such as good worstcase behaviour, make them attractive for database applicdions. Unfortunately, the structures are typically ‘long and skinny’, whereas disk data structuies must be ‘shortand-fat (that is, have a high fanout and low height) in order to minimize I/O. We consider how to c...
متن کاملFlight Path Angle Steering with Lambert Guidance Reference
In this paper a new guidance technique for ballistic missiles and launch vehicles is proposed. Generally the Lambert guidance is used to generate missile nominal (correlated) parameters through powered flight to put it in a ballistic flight path. Because of uncertainties and undesired factors, the nominal position and velocity obtained by Lambert technique need to be followed in actual flight. ...
متن کاملLearning Topology of Curves with Application to Clustering
We propose a method for learning the intrinsic topology of a point set sampled from a curve embedded in a high-dimensional ambient space. Our approach does not rely on distances in the ambient space, and thus can recover the topology of sparsely sampled curves, a situation where extant manifold learning methods are expected to fail. We formulate a loss function based on the smoothness of a curv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2016
ISSN: 1099-4300
DOI: 10.3390/e18090337